Matrix Method Approach to Cafiero Theorem

نویسندگان

  • Paolo de Lucia
  • Endre Pap
چکیده

We give a simple proof of the Cafiero theorem based on a matrix method approach in the form of Lemma 2.4 in the σ-additive context. Based on a version of Drewnowski lemma for an SCP-ring we obtain an extension of Cafiero theorem for exhaustive finitely additive set functions defined on an SCP-ring. As consequences, the well-known Nikodým and Brooks-Jewett convergence theorems are obtained. AMS Mathematics Subject Classification (2000): 28A33

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the square root of quadratic matrices

Here we present a new approach to calculating the square root of a quadratic matrix. Actually, the purpose of this article is to show how the Cayley-Hamilton theorem may be used to determine an explicit formula for all the square roots of $2times 2$ matrices.

متن کامل

MATRIX VALUATION PSEUDO RING (MVPR) AND AN EXTENSION THEOREM OF MATRIX VALUATION

Let R be a ring and V be a matrix valuation on R. It is shown that, there exists a correspondence between matrix valuations on R and some special subsets ?(MVPR) of the set of all square matrices over R, analogous to the correspondence between invariant valuation rings and abelian valuation functions on a division ring. Furthermore, based on Malcolmson’s localization, an alternative proof for t...

متن کامل

Presentation and Solving Non-Linear Quad-Level Programming Problem Utilizing a Heuristic Approach Based on Taylor Theorem

The multi-level programming problems are attractive for many researchers because of their application in several areas such as economic, traffic, finance, management, transportation, information technology, engineering and so on. It has been proven that even the general bi-level programming problem is an NP-hard problem, so the multi-level problems are practical and complicated problems therefo...

متن کامل

A new approach for building recommender system using non negative matrix factorization method

Nonnegative Matrix Factorization is a new approach to reduce data dimensions. In this method, by applying the nonnegativity of the matrix data, the matrix is ​​decomposed into components that are more interrelated and divide the data into sections where the data in these sections have a specific relationship. In this paper, we use the nonnegative matrix factorization to decompose the user ratin...

متن کامل

A new approach for solving the first-order linear matrix differential equations

Abstract. The main contribution of the current paper is to propose a new effective numerical method for solving the first-order linear matrix differential equations. Properties of the Legendre basis operational matrix of integration together with a collocation method are applied to reduce the problem to a coupled linear matrix equations. Afterwards, an iterative algorithm is examined for solvin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004